Recursive constructions for perfect secret sharing schemes
نویسندگان
چکیده
منابع مشابه
Perfect Secret Sharing Schemes from
Secret sharing schemes are one of the most important primitives in distributed systems. In perfect secret sharing schemes, collaboration between unauthorised participants cannot reduce their uncertainty about the secret. This paper presents a perfect secret sharing scheme arising from critical sets of Room squares.
متن کاملSome interesting constructions for secret sharing schemes
This article documents some of the known constructions for secret sharing schemes. It includes a discussion of the mathematical structures which have been used to model secret sharing schemes, the establishment of secret sharing schemes which do not require the existence of a trusted authority to administer them, variations which can be incorporated into these schemes to increase their flexibil...
متن کاملOn Ideal Non-perfect Secret Sharing Schemes
This paper first extends the result of Blakley and Kabatianski [3] to general non-perfect SSS using information-theoretic arguments. Furthermore, we refine Okada and Kurosawa’s lower bound [12] into a much more precise information-theoretic characterization of non-perfect secret sharing idealness. In the light of this generalization, we establish that ideal schemes do not always have a matroida...
متن کاملPerfect Secret Sharing Schemes from Room Squares
Secret sharing schemes are one of the most important primitives in distributed systems In perfect secret sharing schemes collabo ration between unauthorised participants cannot reduce their uncer tainty about the secret This paper presents a perfect secret sharing scheme arising from critical sets of Room squares
متن کاملOptimal Non-perfect Uniform Secret Sharing Schemes
A secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum length of the shares and the length of the secret. This work is dedicated to the search of bounds on the information ratio of non-perfect secret sharing schemes. To this en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1999
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00049-8